New Results on Linear Size Distance Preservers
نویسندگان
چکیده
Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 3 January 2019Accepted: 30 December 2020Published online: 12 April 2021Keywordsshortest paths, graph spanners, extremal theory, distance preserversAMS Subject Headings68, 05Publication DataISSN (print): 0097-5397ISSN (online): 1095-7111Publisher: Society for Industrial and Applied MathematicsCODEN: smjcat
منابع مشابه
Linear Size Distance Preservers
The famous shortest path tree lemma states that, for any node s in a graph G = (V,E), there is a subgraph on O(n) edges that preserves all distances between node pairs in the set {s}×V . A very basic question in distance sketching research, with applications to other problems in the field, is to categorize when else graphs admit sparse subgraphs that preserve distances between a set P of p node...
متن کاملEuclidean and circum-Euclidean distance matrices: Characterizations and linear preservers
Short proofs are given to various characterizations of the (circum-)Euclidean squared distance matrices. Linear preserver problems related to these matrices are discussed.
متن کاملNEW RESULTS ON THE EXISTING FUZZY DISTANCE MEASURES
In this paper, we investigate the properties of some recently pro-posed fuzzy distance measures. We find out some shortcomings for these dis-tances and then the obtained results are illustrated by solving several examplesand compared with the other fuzzy distances.
متن کاملOn multiplicative (strong) linear preservers of majorizations
In this paper, we study some kinds of majorizations on $textbf{M}_{n}$ and their linear or strong linear preservers. Also, we find the structure of linear or strong linear preservers which are multiplicative, i.e. linear or strong linear preservers like $Phi $ with the property $Phi (AB)=Phi (A)Phi (B)$ for every $A,Bin textbf{M}_{n}$.
متن کاملLinear Preservers of Majorization
For vectors $X, Yin mathbb{R}^{n}$, we say $X$ is left matrix majorized by $Y$ and write $X prec_{ell} Y$ if for some row stochastic matrix $R, ~X=RY.$ Also, we write $Xsim_{ell}Y,$ when $Xprec_{ell}Yprec_{ell}X.$ A linear operator $Tcolon mathbb{R}^{p}to mathbb{R}^{n}$ is said to be a linear preserver of a given relation $prec$ if $Xprec Y$ on $mathbb{R}^{p}$ implies that $TXprec TY$ on $mathb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2021
ISSN: ['1095-7111', '0097-5397']
DOI: https://doi.org/10.1137/19m123662x